منابع مشابه
Nullifying randomness and genericity using symmetric difference
For a class C of sets, let us say that a set A is C stabilising if A 4 X ∈ C for every X ∈ C. We prove that the Martin-Löf stabilising sets are exactly the K-trivial sets, as are the weakly 2-random stabilising sets. We also show that the 1-generic stabilising sets are exactly the computable sets.
متن کاملA Randomness Test for Stable Data
In this paper, we propose a new method for checking randomness of non-Gaussian stable data based on a characterization result. This method is more sensitive with respect to non-random data compared to the well-known non-parametric randomness tests.
متن کاملRandomness
Here we present in a single essay a combination and completion of the several aspects of the problem of randomness of individual objects which of necessity occur scattered in our text [10]. The reader can consult different arrangements of parts of the material in [7, 20].
متن کاملCharacterizing strong randomness via Martin-Löf randomness
We introduce two methods to characterize strong randomness notions via Martin-Löf randomness. By applying these methods, we investigate ∅′-Schnorr randomness.
متن کاملω-Change Randomness and Weak Demuth Randomness
We extend our work on difference randomness. Each component of a difference test is a Boolean combination of two r.e. open sets; here we consider tests in which the k component is a Boolean combination of g(k) r.e. open sets for a given recursive function g. We use this method to produce an alternate characterization of weak Demuth randomness in terms of these tests and further show that a real...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2011
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-2010-10513-0